Batch Binary Edwards
نویسنده
چکیده
This paper sets new software speed records for high-security Diffie-Hellman computations, specifically 251-bit elliptic-curve variablebase-point scalar multiplication. In one second of computation on a $200 Core 2 Quad Q6600 CPU, this paper’s software performs 30000 251-bit scalar multiplications on the binary Edwards curve d(x + x + y + y) = (x + x)(y + y) over the field F2[t]/(t 251 + t + t + t + 1) where d = t + t + t +1. The paper’s field-arithmetic techniques can be applied in much more generality but have a particularly efficient interaction with the completeness of addition formulas for binary Edwards curves.
منابع مشابه
Fast Algorithm for Converting Ordinary Elliptic Curves into Binary Edward Form
Scalar multiplication is computationally the most expensive operation in elliptic curve cryptosystems. Many techniques in literature have been proposed for speeding up scalar multiplication. In 2008, Bernstein et al proposed binary Edwards curves on which scalar multiplication is faster than traditional curves. At Crypto 2009, Bernstein obtained the fastest implementation for scalar multiplicat...
متن کاملEdwards model of elliptic curves de ned over any nite eld
In this paper, we present an Edwards model for elliptic curves which is de ned over any perfect eld and in particular over nite elds. This Edwards model is birationally equivalent to the well known Edwards model over non-binary elds and is ordinary over binary elds. For this, we use theta functions of level four to obtain an intermediate model that we call a level 4 theta model. This model enab...
متن کاملMulticlass Distance Weighted Discrimination with Applications to Batch Adjustment
Combining different microarray data sets across platforms has the potential to generally increase statistical power. Distance Weighted Discrimination (DWD) is a powerful tool for solving binary classification problems in high dimensions. It has also been shown to provide an effective approach to binary cross-platform batch adjustment. In this paper, we extend the binary DWD to the multicategory...
متن کاملHalving on Binary Edwards Curves
Edwards curves have attracted great interest for their efficient addition and doubling formulas. Furthermore, the addition formulas are strongly unified or even complete, i.e., work without change for all inputs. In this paper, we propose the first halving algorithm on binary Edwards curves, which can be used for scalar multiplication. We present a point halving algorithm on binary Edwards curv...
متن کامل